LQD is 1.5-competitive for 3-port Shared-Memory Switches
نویسنده
چکیده
We show that the Longest Queue Drop algorithm is 1.5-competitive for shared-memory switches with three output ports. This improves upon the previous best upper bound of (2− 1 M ·bM/3c− 3 M ) for the competitive ratio of the Longest Queue Drop algorithm, for 3-port shared-memory switches, where M denotes the shared-memory size.
منابع مشابه
The Longest Queue Drop Policy for Shared-Memory Switches is 1.5-competitive
We consider the Longest Queue Drop memory management policy in shared-memory switches consisting of N output ports. The shared memory of size M ≥ N may have an arbitrary number of input ports. Each packet may be admitted by any incoming port, but must be destined to a specific output port and each output port may be used by only one queue. The Longest Queue Drop policy is a natural online strat...
متن کاملDynamic Thresholds for Multiple Loss Priorities
Buuer management schemes are needed in shared-memory ATM switches to regulate the sharing of memory among diierent output port queues and among traac classes with diierent loss priorities. Earlier we proposed a single-priority scheme called Dynamic Threshold, in which the maximum permissible queue length is proportional to the unused buuering in the switch. In this paper, we propose, analyze an...
متن کاملHeterogeneous packet processing in shared memory buffers
Packet processing increasingly involves heterogeneous requirements. We consider the well-known model of a shared memory switch with bounded-size buffer and generalize it in two directions. First, we consider unit-sized packets labeled with an output port and a processing requirement (i.e., packets with heterogeneous processing), maximizing the number of transmitted packets. We analyze the perfo...
متن کاملDynamic Queue Length Thresholds for Multipriority Traac
Buuer management schemes are needed in shared-memory ATM switches to regulate the sharing of memory among diierent output port queues and among traac classes with diierent loss priorities. Earlier we proposed a single-priority scheme called Dynamic Threshold, in which the maximum permissible queue length is proportional to the unused buuering in the switch. In this paper, we propose and analyze...
متن کاملHarmonic Buffer Management Policy for Shared Memory Switches
We introduce a new general scheme for shared memory nonpreemptive scheduling policies. Our scheme utilizes a system of inequalities and thresholds and accepts a packet if it does not violate any of the inequalities. We demonstrate that many of the existing policies can be described using our scheme, thus validating its generality. We propose a new scheduling policy, based on our general scheme,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016